Accelerating the Sinkhorn–Knopp iteration by Arnoldi-type methods
نویسندگان
چکیده
منابع مشابه
Analysis of Accelerating Algorithms for the Restarted Arnoldi Iteration
We present an approach for the acceleration of the restarted Arnoldi iteration for the computation of a number of eigenvalues of the standard eigenproblem Ax = x. This study applies the Chebyshev polynomial to the restarted Arnoldi iteration and proves that it computes necessary eigenvalues with far less complexity than the QR method. We also discuss the dependence of the convergence rate of th...
متن کاملCalculation Of Pseudospectra By The Arnoldi Iteration
The rational Krylov algorithm for large nonsymmetric eigenvalues|mapping the resolvent norms (pseudospectrum), draft report based on talk delivered at Sparse Days at St. A generalized Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM. 14 kim-chuan toh and lloyd n. trefethen bility of uid ows in a pipe or a channel, where traditional eigenvalue methods fail to explain the ins...
متن کاملCalculation of Pseudospectra by the Arnoldi Iteration
The Amoldi iteration, usually viewed as a method for calculating eigenvalues, can also be used to estimate pseudospectra. This possibility may be of practical importance, because in applications involving highly nonnormal matrices or operators, such as hydrodynamic stability, pseudospectra may be physically more significant than spectra. 1. Introduction. Large-scale nonsymmetric matrix eigenval...
متن کاملArnoldi-Tikhonov regularization methods
Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix-vector product evaluation...
متن کاملThe Arnoldi Eigenvalue Iteration with Exact Shifts Can Fail
The restarted Arnoldi algorithm, implemented in the ARPACK software library and MATLAB’s eigs command, is among the most common means of computing select eigenvalues and eigenvectors of a large, sparse matrix. To assist convergence, a starting vector is repeatedly refined via the application of automatically-constructed polynomial filters whose roots are known as ‘exact shifts’. Though Sorensen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calcolo
سال: 2020
ISSN: 0008-0624,1126-5434
DOI: 10.1007/s10092-020-0359-7